Orchestrating stream graphs using model checking
نویسندگان
چکیده
منابع مشابه
Automaton based Model Checking Using Multiway Decision Graphs
Abstract. In this paper we present a formal hardware verification tool implementing an automata based model checking algorithm using Multiway Decision Graphs. The tool first transforms the property formula into a Generalized Buchi Automaton. It then uses a newly developed algorithm to check the language emptiness on the product machine composed from the system under verification and the constru...
متن کاملModel Checking Lower Bounds for Simple Graphs
A well-known result by Frick and Grohe shows that deciding FO logic on trees involves a parameter dependence that is a tower of exponentials. Though this lower bound is tight for Courcelle’s theorem, it has been evaded by a series of recent meta-theorems for other graph classes. Here we provide some additional non-elementary lower bound results, which are in some senses stronger. Our goal is to...
متن کاملModel Checking Lower Bounds for Simple Graphs
A well-known result by Frick and Grohe shows that deciding FO logic on trees involves a parameter dependence that is a tower of exponentials. Though this lower bound is tight for Courcelle’s theorem, it has been evaded by a series of recent meta-theorems for other graph classes. Here we provide some additional non-elementary lower bound results, which are in some sense stronger. Our goal is to ...
متن کاملFO Model Checking of Interval Graphs
We study the computational complexity of the FO model checking problem on interval graphs, i.e., intersection graphs of intervals on the real line. The main positive result is that this problem can be solved in time O(n logn) for n-vertex interval graphs with representations containing only intervals with lengths from a prescribed finite set. We complement this result by showing that the same i...
متن کاملFO Model Checking of Geometric Graphs
Over the past two decades the main focus of research into first-order (FO) model checking algorithms has been on sparse relational structures – culminating in the FPT algorithm by Grohe, Kreutzer and Siebertz for FO model checking of nowhere dense classes of graphs. On contrary to that, except the case of locally bounded clique-width only little is currently known about FO model checking of den...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Architecture and Code Optimization
سال: 2013
ISSN: 1544-3566,1544-3973
DOI: 10.1145/2512435